Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: An Experimental Study
نویسندگان
چکیده
Fuzzy constraints are a popular approach to handle preferences and over-constrained problems. We consider here situations where some of the preferences may be missing. This models, for example, settings where agents are distributed, or have privacy issues, or where there is an ongoing preference elicitation process. We study how to find a solution which is optimal irrespective of the missing preferences, eliciting preferences from the user if necessary. Our goal is to ask the user as little as possible. To solve this task, we define a combined solving and preference elicitation scheme with a large number of different instantiations which we test on randomly generated problems. Our experimental results show that some of the algorithms are very good at finding a necessarily optimal solution while asking only a very small fraction of the missing preferences to the user. We also test the algorithms on hard constraint problems with possibly missing constraints. The aim now is to find feasible solutions irrespective of the missing constraints.
منابع مشابه
Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or where there is an ongoing preference elicitation process. In this context, we study how to find an optimal solution without having to wait for all the preferences. In particular, we define algorithms, that interleave s...
متن کاملElicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies
Fuzzy constraints are a popular approach to handle preferences and over-constrained problems in scenarios where one needs to be cautious, such as in medical or space applications. We consider here fuzzy constraint problems where some of the preferences may be missing. This models, for example, settings where agents are distributed and have privacy issues, or where there is an ongoing preference...
متن کاملA Local Search Approach to Solve Incomplete Fuzzy CSPs
We consider fuzzy constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or where there is an ongoing preference elicitation process. In this context, we study how to find an optimal solution without having to wait for all the preferences. In particular, we define local search algorithms that...
متن کاملA local search approach to solve incomplete fuzzy and weighted CSPs
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or where there is an ongoing preference elicitation process. In this context, we study how to find an optimal solution without having to wait for all the preferences. In particular, we define local search algorithms that ...
متن کاملDealing with Incomplete Preferences in Soft Constraint Problems
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, situations with several agents providing the data, or with possible privacy issues. In this context, we study how to find an optimal solution without having to wait for all the preferences. In particular, we define an algorithm to find a solution which is necessarily optimal, that is...
متن کامل